منابع مشابه
3-colorable subclasses of P8-free graphs
In this paper, we study 3-colorable graphs having no induced 8-vertex path and no induced cycles of specific lengths. We prove a characterization by critical graphs in three particular cases.
متن کاملSmaller planar triangle-free graphs that are not 3-list-colorable
In 1995,Voigt constructed a planar triangle-free graph that is not 3-list-colorable. It has 166 vertices. Gutner then constructed such a graph with 164 vertices. We present two more graphs with these properties. The first graph has 97 vertices and a failing list assignment using triples from a set of six colors, while the second has 109 vertices and a failing list assignment using triples from ...
متن کاملKr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges
There is a conjecture due to Shaoji 3], about uniquely vertex r-colorable graphs which states: \ If G is a uniquely vertex r-colorable graph with order n and size (r ? 1)n ? ? r 2 , then G contains a K r as its subgraph." In this paper for any natural number r we construct a K r-free, uniquely r-colorable graph with (r ? 1)n ? ? r 2 edges. These families of graphs are indeed counter examples to...
متن کاملDense triangle-free graphs are four-colorable: A solution to the Erdős-Simonovits problem
In 1972, Erdős and Simonovits [9] asked whether a triangle-free graph with minimum degree greater than n/3, where n is the number of vertices, has chromatic number at most three. Hajnal provided examples of triangle-free graphs with arbitrarily large chromatic number and minimum degree greater than (1/3− ε)n, for every ε > 0. Häggkvist [10] gave a counterexample to the Erdős-Simonovits problem ...
متن کاملTriangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K4 are 3-colorable. This proves a conjecture of Trotignon and Vušković [5]. ∗Supported by NSF grant DMS-1550991 and US Army Research Office Grant W911NF16-1-0404. †Partially supported by ANR project Stint under reference ANR-13-BS02-0007 and by the LABEX MILYON (ANR-10-LABX-0070) of Universi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2019
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m1205832